Aggregation-based Adaptive Algebraic Multigrid for Sparse Linear Systems
نویسنده
چکیده
Acknowledgements I would like to thank Prof. Irad Yavneh for his invaluable guidance throughout this research, and for being a friend and teammate whose door is always open. His original ideas, experienced suggestions and great help were crucial to this research. I hope to keep working with you in the future; you made this experience truly meaningful and enjoyable. I want to thank my mentors and friends in the Technion for teaching me and sharing this experience with me. You have made my academic journey very special, and sparked my interest in computational mathematics. I would also like to thank to my colleagues and mentors in the Multigrid community for fascinating collaborations and discussions that have enriched my experience as a researcher. Thanks to you, attending the Copper mountain conferences and AMG summit truly feels like a visiting a family, and I hope to continue attending those and strengthen our friendship in the future. Lastly, I would like to thank the members of my thesis committee for their insightful remarks and valuable advice. Most importantly, I would like to thank my dear wife Dorit for her support, love, patience, and encouragement. It was an absolute pleasure to share this experience with you, and to raise our two children Kfir and Eyal, along the way. I would like to thank my parents, Shmuel and Kochava, and Dorit's parents, Lisa and Ilan, for their great help and love throughout this journey. My work would never be the same without you all. Funding Acknowledgements • Eran Treister is grateful to the Azrieli Foundation for the award of an Azrieli Fellowship. Being part of this fellowship has been a great honor and a truly enriching experience.
منابع مشابه
Multilevel Adaptive Aggregation for Markov Chains, with Application to Web Ranking
A multilevel adaptive aggregation method for calculating the stationary probability vector of an irreducible stochastic matrix is described. The method is a special case of the adaptive smooth aggregation and adaptive algebraic multigrid methods for sparse linear systems, and is also closely related to certain extensively studied iterative aggregation/disaggregation methods for Markov chains. I...
متن کاملA Novel Aggregation Method based on Graph Matching for Algebraic MultiGrid Preconditioning of Sparse Linear Systems
Multilevel techniques are very effective tools for preconditioning iterative Krylov methods in the solution of sparse linear systems; among them, Algebraic MultiGrid (AMG) are widely employed variants. In [2, 4] it is shown how parallel smoothed aggregation techniques can be used in combination with domain decomposition Schwarz preconditioners to obtain AMG preconditioners; the effectiveness of...
متن کاملA GPU Accelerated Aggregation Algebraic Multigrid Method
We present an efficient, robust and fully GPU-accelerated aggregation-based algebraic multigrid preconditioning technique for the solution of large sparse linear systems. These linear systems arise from the discretization of elliptic PDEs. The method involves two stages, setup and solve. In the setup stage, hierarchical coarse grids are constructed through aggregation of the fine grid nodes. Th...
متن کاملNon-Galerkin Multigrid Based on Sparsified Smoothed Aggregation
Algebraic Multigrid (AMG) methods are known to be efficient in solving linear systems arising from the discretization of partial differential equations and other related problems. These methods employ a hierarchy of representations of the problem on successively coarser meshes. The coarse-grid operators are usually defined by (Petrov-)Galerkin coarsening, which is a projection of the original o...
متن کاملSmoothed aggregation multigrid solvers for high-order discontinuous Galerkin methods for elliptic problems
We develop a smoothed aggregation-based algebraic multigrid solver for high-order discontinuous Galerkin discretizations of the Poisson problem. Algebraic multigrid is a popular and effective method for solving the sparse linear systems that arise from discretizing partial differential equations. However, high-order discontinuous Galerkin discretizations have proved challenging for algebraic mu...
متن کاملA new perspective on strength measures in algebraic multigrid
Algebraic-based multilevel solution methods (e.g. classical Ruge–Stüben and smoothed aggregation style algebraic multigrid) attempt to solve or precondition sparse linear systems without knowledge of an underlying geometric grid. The automatic construction of a multigrid hierarchy relies on strength-of connection information to coarsen the matrix graph and to determine sparsity patterns for the...
متن کامل